Bibliography on the Signless Laplacian Eigenvalues: First One Hundred References
نویسنده
چکیده
Recall that, given a graph G, the matrix Q = D + A is called the signless Laplacian, where A is the adjacency matrix and D is the diagonal matrix of vertex degrees. The matrix L = D − A is known as the Laplacian of G. Graphs with the same spectrum of an associated matrix M are called cospectral graphs with respect to M , or M–cospectral graphs. A graph H cospectral with a graph G, but not isomorphic to G, is called a cospectral mate of G. Let G be a finite set of graphs, and let G ′ be the set of graphs in G which have a cospectral mate in G with respect to M . The ratio |G ′|/|G| is called the spectral uncertainty of (graphs from) G with respect to M . The papers [15], [16] provide spectral uncertainties rn with respect to the adjacency matrix A, sn with respect to the Laplacian L and qn with respect to the signless Laplacian Q of sets of all graphs on n vertices for n ≤ 11: the numbers qn are smaller than the numbers rn and sn for n ≥ 7. This was a strong basis for believing that studying graphs by Q–spectra is more efficient than studying them by other spectra. This idea was accepted in [19] where it was also noted that almost no results in the literature on the spectra of signless Laplacian existed at that time. Moreover, connection with spectra of line graphs and the existence of a well developed theory of graphs with least eigenvalue −2 were used as additional arguments for studying eigenvalues of the signless Laplacian. Next step was the paper [22] where known results were surveyed together with presentation of some new results. This paper was cited in almost all subsequent papers on the subject. An important role in attracting many researchers played the paper [23] where thirty computer generated conjectures have been published. Once the number of papers on the subject started to grow substantially, my colleague S. Simić and I decided to classify old and new knowledge and to sketch a theory on the signless Laplacian eigenvalues. We published the papers [41], [67], [68] with the common title ”Towards a spectral theory of graphs based on the signless Laplacian”. Papers on signless Laplacian eigenvalues are continuously being published. By the end of 2010 their number has reached one hundred as the following bibliography shows.
منابع مشابه
The Signless Laplacian Estrada Index of Unicyclic Graphs
For a simple graph $G$, the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$, where $q^{}_1, q^{}_2, dots, q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...
متن کاملSeidel Signless Laplacian Energy of Graphs
Let $S(G)$ be the Seidel matrix of a graph $G$ of order $n$ and let $D_S(G)=diag(n-1-2d_1, n-1-2d_2,ldots, n-1-2d_n)$ be the diagonal matrix with $d_i$ denoting the degree of a vertex $v_i$ in $G$. The Seidel Laplacian matrix of $G$ is defined as $SL(G)=D_S(G)-S(G)$ and the Seidel signless Laplacian matrix as $SL^+(G)=D_S(G)+S(G)$. The Seidel signless Laplacian energy $E_{SL^+...
متن کاملSome remarks on the sum of the inverse values of the normalized signless Laplacian eigenvalues of graphs
Let G=(V,E), $V={v_1,v_2,ldots,v_n}$, be a simple connected graph with $%n$ vertices, $m$ edges and a sequence of vertex degrees $d_1geqd_2geqcdotsgeq d_n>0$, $d_i=d(v_i)$. Let ${A}=(a_{ij})_{ntimes n}$ and ${%D}=mathrm{diag }(d_1,d_2,ldots , d_n)$ be the adjacency and the diagonaldegree matrix of $G$, respectively. Denote by ${mathcal{L}^+}(G)={D}^{-1/2}(D+A) {D}^{-1/2}$ the normalized signles...
متن کاملSIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM
Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$ and $A(G)$ the adjacency matrix of $G$. The signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...
متن کامل